Upward and quasi-upward planarity testing of embedded mixed graphs
نویسندگان
چکیده
منابع مشابه
Upward Spirality and Upward Planarity Testing
The upward planarity testing problem is known to be NPhard. We describe an O(n)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.
متن کاملQuasi - Upward Planarity ? ( Extended Abstract )
In this paper we introduce the quasi-upward planar drawing convention and give a polynomial time algorithm for computing a quasiupward planar drawing with the minimum number of bends within a given planar embedding. Further, we study the problem of computing quasi-upward planar drawings with the minimum number of bends of digraphs considering all the possible planar embeddings. The paper contai...
متن کاملUpward Planarity Testing via SAT
A directed acyclic graph is upward planar if it allows a drawing without edge crossings where all edges are drawn as curves with monotonously increasing y-coordinates. The problem to decide whether a graph is upward planar or not is NP-complete in general, and while special graph classes are polynomial time solvable, there is not much known about solving the problem for general graphs in practi...
متن کاملOn the Upward Planarity of Mixed Plane Graphs
A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed plane graph G. In this paper, we study the computational complexity of testing whether a given mixed plane graph G is upward planar, i.e., whether...
متن کاملRolling Upward Planarity Testing of Strongly Connected Graphs
A graph is upward planar if it can be drawn without edge crossings such that all edges point upward. Upward planar graphs have been studied on the plane, the standing and rolling cylinders. For all these surfaces, the respective decision problem NP-hard in general. Efficient algorithms exist if the graph contains a single source and a single sink, but only for the plane and standing cylinder He...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.01.015